Optimal Car Dispatching For Elevator Groups Using Genetic Algorithms
نویسندگان
چکیده
منابع مشابه
Optimal Car Dispatching For Elevator Groups Using Genetic Algorithms
The car dispatching problem in an elevator group consists of assigning cars to the hall calls at the same time that car call are served. The problem needs to coordinate the movements of individual cars with the objective of operating efficiently the whole group. In this paper, we propose an elevator group control system based on a genetic algorithm which makes use of a novel fitness function to...
متن کاملOptimal Elevator Group Control Using Genetic Algorithms
This paper presents an optimal control strategy for elevator group in large buildings. An elevator group controller allocates different elevators to up and down hall calls that coming from different floors. The control strategy is a precondition to minimize mainly the average waiting time of hall calls. In this paper, two genetic algorithms are developed to treat efficiently the elevator group ...
متن کاملElevator Dispatching Using Heuristic Search
Monitoring and prediction of passenger movements are able to generate timely heuristic information that reduces the complexity of the elevator dispatching task to one of finding the best route through already computed data. This paper demonstrates that such information, when used by heuristic search techniques, allows optimal dispatching solutions to be achieved in a practical elevator installa...
متن کاملOptimal dispatching control for elevator systems during uppeak traffic
In this paper we develop optimal dispatching controllers for elevator systems during uppeak traffic. An uppeak traffic period arises when the bulk of the passenger traffic is moving from the first floor up into the building (e.g., the start of a business day in an office building). The cars deliver the passengers and then return empty to the first floor to pick up more passengers. We show that ...
متن کاملThe Elevator Dispatching Problem
In this paper, we formulate the elevator dispatching problem as a stochastic bilevel optimization problem, where a group of elevators serves a set of transportation requests. In the upper level, the requests are assigned to the elevators. In the lower level, the route for each elevator is solved separately. The lower level problem predicts the optimal system state for a finite planning horizon ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Intelligent Automation & Soft Computing
سال: 2010
ISSN: 1079-8587,2326-005X
DOI: 10.1080/10798587.2010.10643066